Obtaining Psychologically Motivated Spaces with MDS

نویسنده

  • Mikael Johannesson
چکیده

The main purpose with this paper is to describe how a psychologically motivated conceptual space can be obtained with MDS (multidimensional scaling) and how it can be expressed in terms of a more primitive “physical” (or mathematical) one. The idea is demonstrated practically with the aid of two experimental pilot studies. The paper is concluded by a critical discussion of the method used.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Toeplitz MDS Matrices

This work considers the problem of constructing efficient MDS matrices over the field F2m . Efficiency is measured by the metric XOR count which was introduced by Khoo et al. in CHES 2014. Recently Sarkar and Syed (ToSC Vol. 1, 2016) have shown the existence of 4 × 4 Toeplitz MDS matrices with optimal XOR counts. In this paper, we present some characterizations of Toeplitz matrices in light of ...

متن کامل

Psychologically Motivated Clonal Algorithm based Approach to Solve Planning Problem

Planning is a subject of interest to the Artificial Intelligence community. Genetic algorithms, neural networks, and simulated annealing are heuristic search methods often used to solve complex optimization problems. In this paper, we have proposed a novel intelligence paradigm to solve planning problems. This paper extends the Artificial Immune System (AIS) approach by proposing a new methodol...

متن کامل

The Covering Problem in Rosenbloom-Tsfasman Spaces

We investigate the covering problem in RT spaces induced by the RosenbloomTsfasman metric, extending the classical covering problem in Hamming spaces. Some connections between coverings in RT spaces and coverings in Hamming spaces are derived. Several lower and upper bounds are established for the smallest cardinality of a covering code in an RT space, generalizing results by Carnielli, Chen an...

متن کامل

Variations to the Cryptographics Algorithms AES and Twofish

The Cryptographics Algorithms AES and Twofish guarantee a high diffusion with the use of fixed MDS matrices of size 4 × 4. In this article variations to the Cryptographics Algorithms AES and Twofish are made. They allow that the process of cipher decipher come true with MDS matrices selected randomly from an algorithm that obtaining an MDS matrix of set of all the MDS matrices possible. A new S...

متن کامل

The versatility of SpAM: a fast, efficient, spatial method of data collection for multidimensional scaling.

Although traditional methods to collect similarity data (for multidimensional scaling [MDS]) are robust, they share a key shortcoming. Specifically, the possible pairwise comparisons in any set of objects grow rapidly as a function of set size. This leads to lengthy experimental protocols, or procedures that involve scaling stimulus subsets. We review existing methods of collecting similarity d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996